Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
31	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
32	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover
33	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring
34	C:uments and Settingsc. documentoscheTt 27, 1T.dvi Add to Reading List Source URL: personales.upv.es Language: English - Date: 2004-02-19 03:12:54 Genetic algorithms Applied mathematics Operations research Mathematics Cybernetics Computational complexity theory NP-complete problems Mathematical optimization Crossover Chromosome Mutation Vehicle routing problem
35	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
36	Fairfield County Lineage Society Application Guidelines and Checklist GENERAL INFORMATION Miscellaneous Information: 1. All applications and supporting documents become the property of FCC-OGS. 2. By submitting an applic Add to Reading List Source URL: www.fairfieldgenealogy.org Language: English - Date: 2014-01-19 16:16:57 Epistemology Philosophy Logic Automated theorem proving Computational complexity theory Critical thinking Logical truth Proof Genealogy Mathematical proof Divorce Maiden and married names
37	Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2008-05-15 11:50:35 Mathematics Computational complexity theory Dynamic programming Discrete mathematics Combinatorics Analysis of algorithms Algorithm Mathematical logic Theoretical computer science Time complexity FisherYates shuffle Longest increasing subsequence
38	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-02-07 15:14:45 Analysis of algorithms Computational complexity theory Time complexity Computer science Algorithm Mathematics Academia Oblivious data structure
39	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
40	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding

UPDATE